A Load Balancing Procedure for Parallel Constraint Programming
نویسندگان
چکیده
In this paper, we design a parallel Constraint Programming (CP) method to solve Constraint Satisfaction Problems (CSP). We use some attributes induced by the CP model of a CSP to improve the load balancing procedure embedded in the parallel treebased search algorithm. Load balancing is improved by using specialized branching heuristics and workload estimators based on the CP model. More precisely, solution counting is used as an approximation of the computational size of the tasks in the parallel CP solver. This approximation of the workload of a task improves the work decomposition or work splitting procedure as well as the distribution of the tasks in the parallel algorithm. Experimental results indicate that this information speeds up the parallel exploration of the search tree.
منابع مشابه
Parallel-machine Scheduling with Load-balancing and Sequence-dependent Setups
In many practical manufacturing environments, setups consume a significant amount of industrial resources. Therefore, reducing setups in a non-identical parallel machine environment will significantly enhance a company’s performance level. In this thesis, the problem of minimizing total completion time with load balancing and sequence-dependent setups in a non-identical parallel machine environ...
متن کاملA Component-Based Parallel Constraint Solver
As a case study that illustrates our view on coordination and component-based software engineering, we present the design and implementation of a parallel constraint solver. The parallel solver coordinates autonomous instances of a sequential constraint solver, which is used as a software component. The component solvers achieve load balancing of tree search through a time-out mechanism. Experi...
متن کاملTwo-constraint domain decomposition with Space Filling Curves
In scientific computing, Space Filling Curves are a widely used tool for one-constraint domain decomposition. They provide a mechanism to sort multi-dimensional data in a locality preserving way, and, in this way, a (one dimensional) list of mesh elements is established which is subsequently split into partitions under consideration of the constraint. This procedure has a runtime of O(N logN) (...
متن کاملMultithreaded Constraint Programming and Applications
MULTITHREADED CONSTRAINT PROGRAMMING AND APPLICATIONS by Fabian Zabatta Adviser: Professor Kenneth McAloon Constraint programming is a powerful and robust software technology for modeling and solving difficult combinatorial problems. However, as problems grow larger in scale and complexity, they become increasingly difficult to solve and their execution times can exhibit inordinate growth. One ...
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کامل